Nonlinear System Identification using a New Sliding-Window Kernel RLS Algorithm

نویسندگان

  • Steven Van Vaerenbergh
  • Javier Vía
  • Ignacio Santamaría
چکیده

In this paper we discuss in detail a recently proposed kernel-based version of the recursive least-squares (RLS) algorithm for fast adaptive nonlinear filtering. Unlike other previous approaches, the studied method combines a sliding-window approach (to fix the dimensions of the kernel matrix) with conventional ridge regression (to improve generalization). The resulting kernel RLS algorithm is applied to several nonlinear system identification problems. Experiments show that the proposed algorithm is able to operate in a time-varying environment and to adjust to abrupt changes in either the linear filter or the nonlinearity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Knowledge Discovery and Data Mining KERNEL-BASED METHODS FOR NON-STATIONARY TIME-SERIES IDENTIFICATION AND PREDICTION

Identification and prediction problem of nonlinear time-series generated by discrete dynamic system is considered via Kernel Method approach. A unified approach to recurrent kernel identification algorithms design is proposed. In such a way a recurrent modification of initial Kernel Method with growing windows is considered. In order to prevent the model complexity increasing under on-line iden...

متن کامل

A New Formalism of the Sliding Window Recursive Least Squares Algorithm and Its Fast Version

A new compact form of the sliding window recursive least squares (SWRLS) algorithm, the I-SWRLS algorithm, is derived using an indefinite matrix. The resultant algorithm has a form similar to that of the traditional recursive least squares (RLS) algorithm, and is more computationally efficient than the conventional SWRLS algorithm including two Riccati equations. Furthermore, a computationally ...

متن کامل

A Sliding Window RLS - like Adaptive Algorithm for Filtering - stable NoiseMurat

We introduce a sliding window adaptive RLS-like algorithm for ltering-stable noise. Unless previously introduced stochastic gradient type algorithms, the new adaptation algorithm minimizes the L p norm of the error exactly in a sliding window of xed size. Therefore, it behaves much like the RLS algorithm in terms of convergence speed and computational complexity compared to previously introduce...

متن کامل

Terminal Sliding Mode Control for Nonlinear Systems with both Matched and Unmatched Uncertainties

In this paper, we extend the sliding mode idea to a class of unmatched uncertain variable structure systems. This method is achieved with introducing a new terminal sliding variable and the finite time stability of proposed method is proved using a new particular finite time condition in both reaching and sliding phases. In reaching phase new sliding mode controller is derived to guarantee the ...

متن کامل

A novel variable-length sliding window blockwise least-squares algorithm for on-line estimation of time-varying parameters

Motivated by the advances in computer technology and the fact that the batch/block least-squares (LS) produces more accurate parameter estimates than its recursive counterparts, several important issues associated with the block LS have been re-examined in the framework of on-line identification of systems with abrupt/gradual change parameters in this paper. It is no surprise that the standard ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JCM

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2007